ExamPlay Light Logo
Είσοδος

Computer Science for IGCSE & O level - Algorithm Design And Problem Solving (Section 7 - No. 23)

In a linear search, when is the search considered complete?
When the target item is found.
When the end of the list is reached.
When the search counter reaches a certain value.
When the data is sorted.

Εξήγηση

A linear search stops either when the target item is found or the entire list is checked.

Σχόλια (0)

Είσοδος για σχόλιο
Διαφήμιση
BrainBehindX Inc Logo
©2026; Τροφοδοτείται από BrainBehindX Inc